A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. The main challenge of such computations is the high memory effort classical solvers, which limits accuracy chosen discretizations. In this work, we derive method computation when underlying solution has low-rank structure. This accomplished by utilizing dynamical approximation (DLRA), an efficient strategy to time evolution equations representations. idea interpret iterates inverse power iteration as pseudo-time steps and apply DLRA concepts in framework. our experiment, demonstrate that significantly reduces requirements while achieving desired accuracy. Analytic investigations show proposed scheme inherits convergence speed iteration, at least simplified setting.